Software Packages for Holonomic Gradient Method
نویسندگان
چکیده
We present software packages for the holonomic gradient method (HGM). These packages compute normalizing constants and the probabilities of some regions. While many algorithms which compute integrals over high-dimensional regions utilize the Monte-Carlo method, our HGM utilizes algorithms for solving ordinary differential equations such as the Runge-Kutta-Fehlberg method. As a result, our HGM can evaluate many integrals with a high degree of accuracy and moderate computational time. The source code of our packages is distributed on our web page [12]. .
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Calculation of Orthant Probabilities by the Holonomic Gradient Method
We apply the holonomic gradient method (HGM) introduced by [9] to the calculation of orthant probabilities of multivariate normal distribution. The holonomic gradient method applied to orthant probabilities is found to be a variant of Plackett’s recurrence relation ([14]). However a straightforward implementation of the method yields recurrence relations more suitable for numerical computation ...
متن کاملCalculation of orthant probabilities by the holonomic gradient method
We apply the holonomic gradient method (HGM) introduced by [9] to the calculation of orthant probabilities of multivariate normal distribution. The holonomic gradient method applied to orthant probabilities is found to be a variant of Plackett’s recurrence relation ([14]). However an implementation of the method yields recurrence relations more suitable for numerical computation than Plackett’s...
متن کاملPfaffian Systems of A-Hypergeometric Systems II - Holonomic Gradient Method
We give two efficient methods to derive Pfaffian systems for A-hypergeometric systems for the application to the holonomic gradient method for statistics. We utilize the Hilbert driven Buchberger algorithm and Macaulay type matrices in the two methods.
متن کاملHolonomic gradient method for distribution function of a weighted sum of noncentral chi-square random variables
We apply the holonomic gradient method to compute the distribution function of a weighted sum of independent noncentral chi-square random variables. It is the distribution function of the squared length of a multivariate normal random vector. We treat this distribution as an integral of the normalizing constant of the Fisher-Bingham distribution on the unit sphere and make use of the partial di...
متن کاملMIMO Zero-Forcing Detection Performance Evaluation by Holonomic Gradient Method
We have recently derived infinite-series expressions for performance measures of multiple-input multipleoutput (MIMO) spatial multiplexing with zero-forcing detection (ZF) for Rician–Rayleigh fading, which is relevant in heterogeneous networks. These expressions ensue from a well-known infinite-series expansion around σ = 0 of the confluent hypergeometric function 1F1(·, ·, σ). Theoretically, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014